Maximum flow problem

Results: 146



#Item
41Routing algorithms / Network flow / Network theory / Shortest path problem / Routing / Maximum flow problem / Floyd–Warshall algorithm / Graph / Network topology / Graph theory / Mathematics / Theoretical computer science

System Area Network Mapping Alan M. Mainwaring Brent N. Chun Saul Schleimer Daniel S. Wilkerson

Add to Reading List

Source URL: daniel-wilkerson.appspot.com

Language: English
42Spanning tree / Network flow / Graph connectivity / Maximum flow problem / Randomized algorithm / Minimum spanning tree / Connectivity / Cut / SL / Theoretical computer science / Graph theory / Mathematics

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and †

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-31 22:48:01
43Computing / Local consistency / Constraint satisfaction problem / Constraint satisfaction / Maximum flow problem / Constraint inference / Constraint programming / Software engineering / Computer programming

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints∗ Christian Bessiere LIRMM, CNRS and U. Montpellier

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2010-11-22 06:22:28
44Search algorithms / Network flow / Depth-first search / Breadth-first search / Correlation clustering / Maximum flow problem / Flow network / Tree / Connectivity / Graph theory / Mathematics / Combinatorics

Seeking Stable Clusters in the Blogosphere Nilesh Bansal Fei Chiang University of Toronto

Add to Reading List

Source URL: www.blogscope.net

Language: English - Date: 2012-04-10 15:02:30
45Network flow / Network theory / Maximum flow problem / Flow network / Shortest path problem / Matching / Petersen graph / Graph / Distance / Graph theory / Mathematics / Theoretical computer science

ICS 260 – Fall 2001 – First Midterm Name: ANSWER KEY

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2001-10-18 19:06:29
46NP-complete problems / Delaunay triangulation / Triangulation / Maximum flow problem / Cut / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:32:58
47Applied mathematics / Linear programming / Simplex algorithm / Simplex / Algorithm / Shortest path problem / Maximum flow problem / Degeneracy / Greedoid / Mathematics / Mathematical optimization / Operations research

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:13
48Theoretical computer science / Maximum flow problem / Flow network / Minimum-cost flow problem / Ford–Fulkerson algorithm / Edmonds–Karp algorithm / Shortest path problem / Matching / Max-flow min-cut theorem / Graph theory / Mathematics / Network flow

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:11
49Operations research / Graphical models / Submodular set function / Belief propagation / Maximum flow problem / Factor graph / Tree decomposition / Algorithm / Linear programming / Graph theory / Mathematics / Network flow

Graph Cuts is a Max-Product Algorithm Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-07-15 18:06:25
50Network flow / NP-complete problems / Graph partition / Graph operations / Maximum flow problem / Topology / Flow network / Connectivity / Planar separator theorem / Graph theory / Theoretical computer science / Mathematics

Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a

Add to Reading List

Source URL: systemsresilience.org

Language: English - Date: 2014-12-15 22:25:12
UPDATE